Computer Systems: A Programmer's Perspective (Global Edition): The Spectrum of Control Flow: From Sequential to Exceptional

Standard control flow is a predictable march: the program counter moves from address $a_k$ to $a_{k+1}$ based on sequential logic or explicit jumps. However, Exceptional Control Flow (ECF) represents the "abrupt" transitions that occur outside this normal stream.

1. The Mathematical Model

Processor execution is a sequence $a_0, a_1, \dots, a_{n-1}$, where each $a_k$ corresponds to an instruction $I_k$. ECF breaks this chain when a change in processor state—an event—triggers a jump to a specialized handler not found in the application's immediate code path.

2. Implementation Levels

ECF bridges the gap between hardware and software. It ranges from hardware-level exceptions (faults, interrupts) to OS-level context switching and signals.

3. The "Abrupt" Reality

Whether it is a user hitting Ctrl+C or a system call requesting disk access, ECF forces the CPU to jump to a different "world"—the kernel—ensuring the system remains responsive to dynamic state changes.

TERMINAL bash — 80x24

> Ready. Click "Run" to execute.

QUESTION 1

Practice Problem 8.1: Given Process A(1-3), B(2-5), and C(4-6), which pair is NOT concurrent?

Processes A and B

Processes A and C

Processes B and C

All processes are concurrent.

QUESTION 2

Which function is called once but returns only if there is an error?

fork()

exit()

execve()

waitpid()

QUESTION 3

In the mathematical model of control flow, what triggers an 'exceptional' transition?

A standard sequential instruction Iₖ₊₁

An explicit loop or function call

A change in processor state (Event)

The end of the program counter

QUESTION 4

Which function behavior matches: 'Called once, returns either a pointer or NULL'?

getenv()

fork()

exit()

longjmp()

QUESTION 5

If a process receives a signal of type k while another signal of type k is pending, what happens?

The signal is queued.

The signal is discarded.

The kernel crashes.

The handler is interrupted by the new signal.

Case Study: Analyzing Execution Flow in global-waitprob1.c

Synchronization and ECF Transitions

Consider a program where a parent process calls fork() to create a child, and the parent immediately calls waitpid() to reap it. Analyze the resulting control flow divergence and convergence.

How many output lines does this program generate and what is the ordering principle?

Solution:
The program generates 2 output lines. The ordering is strictly deterministic: the child's output must appear before the parent's final output because waitpid() acts as a synchronization barrier, forcing the parent's sequential flow to pause until the child's exceptional exit state is processed.

Required Output Task: Analyze the global-waitprob1.c execution flow (approx. 200 words).

Solution:
The execution of global-waitprob1.c serves as a textbook illustration of Exceptional Control Flow through process management. Upon reaching the fork() call at address a_k, the system state undergoes a profound transition. The operating system creates a duplicate logical control flow—the child—which begins its own sequence starting from a duplicate set of registers and address space. This creates a divergence where two distinct sequences (a_0...a_n) coexist. The parent process immediately encounters the waitpid() system call, which is a 'Trap' class exception. This call effectively places the parent's sequential instruction stream in a suspended state, waiting for a hardware-triggered event: the child's termination. In this moment, the child process executes its unique path independently. When the child calls exit(), an exceptional event occurs that notifies the kernel. The kernel then context-switches back to the parent, resolving the waitpid() block. This synchronization barrier ensures that the child's logical flow is 'reaped' before the parent proceeds. Ultimately, the two flows, though briefly concurrent and independent, are reconciled by the OS to ensure predictable output, proving that ECF is not chaotic but a highly structured collaboration between the hardware, kernel, and application logic.